Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

rev1(a) -> a
rev1(b) -> b
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(++2(x, x)) -> rev1(x)

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

rev1(a) -> a
rev1(b) -> b
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(++2(x, x)) -> rev1(x)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

REV1(++2(x, y)) -> REV1(x)
REV1(++2(x, y)) -> REV1(y)
REV1(++2(x, x)) -> REV1(x)

The TRS R consists of the following rules:

rev1(a) -> a
rev1(b) -> b
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(++2(x, x)) -> rev1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

REV1(++2(x, y)) -> REV1(x)
REV1(++2(x, y)) -> REV1(y)
REV1(++2(x, x)) -> REV1(x)

The TRS R consists of the following rules:

rev1(a) -> a
rev1(b) -> b
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(++2(x, x)) -> rev1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


REV1(++2(x, y)) -> REV1(x)
REV1(++2(x, y)) -> REV1(y)
REV1(++2(x, x)) -> REV1(x)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( REV1(x1) ) = max{0, x1 - 2}


POL( ++2(x1, x2) ) = x1 + x2 + 3



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ QDPOrderProof
        ↳ QDP
          ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

rev1(a) -> a
rev1(b) -> b
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(++2(x, x)) -> rev1(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.